A New Block Krylov Subspace Method for Computing High Accuracy Solutions
نویسندگان
چکیده
In this paper, the influence of errors which arise in matrix multiplications on the accuracy of approximate solutions generated by the Block BiCGSTAB method is analyzed. In order to generate high accuracy solutions, a new Block Krylov subspace method is also proposed. Some numerical experiments illustrate that high accuracy solutions can be obtained by using the proposed method compared with the Block BiCGSTAB method.
منابع مشابه
Block s-step Krylov iterative methods
Block (including s-step) iterative methods for (non)symmetric linear systems have been studied and implemented in the past. In this article we present a (combined) block s-step Krylov iterative method for nonsymmetric linear systems. We then consider the problem of applying any block iterative method to solve a linear system with one right-hand side using many linearly independent initial resid...
متن کاملSpectral Methods for Time-dependent Variable-coefficient PDE Based on Block Gaussian Quadrature
Block Krylov subspace spectral (KSS) methods are a “best-of-both-worlds” compromise between explicit and implicit time-stepping methods for variable-coefficient PDE, in that they combine the efficiency of explicit methods and the stability of implicit methods, while also achieving spectral accuracy in space and high-order accuracy in time. Block KSS methods compute each Fourier coefficient of t...
متن کاملA Parallel Krylov-Type Method for Nonsymmetric Linear Systems
Parallel Krylov (S-step and block) iterative methods for linear systems have been studied and implemented in the past. In this article we present a parallel Krylov method based on block s-step method for nonsymmetric linear systems. We derive two new averaging algorithm to combine several approximations to the solution of a single linear system using the block method with multiple initial guess...
متن کاملA block Krylov subspace time-exact solution method for linear ODE systems
We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y = −Ay + g(t) and y = −Ay + g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decompos...
متن کاملBlock Krylov subspace exact time integration of linear ODE systems. Part 1: algorithm description
We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y ′ = −Ay+g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decomposition). The second stage is a...
متن کامل